Łukasiewicz μ-calculus
نویسندگان
چکیده
The paper explores properties of Łukasiewicz μ-calculus, a version of the quantitative/probabilistic modal μ-calculus containing both weak and strong conjunctions and disjunctions from Łukasiewicz (fuzzy) logic. We show that this logic encodes the well-known probabilistic temporal logic PCTL. And we give a model-checking algorithm for computing the rational denotational value of a formula at any state in a finite rational probabilistic nondeterministic transition system.
منابع مشابه
Łukasiewicz μ - calculus Matteo Mio
The paper explores properties of Łukasiewicz μ-calculus, a version of the quantitative/probabilistic modal μ-calculus containing both weak and strong conjunctions and disjunctions from Łukasiewicz (fuzzy) logic. We show that this logic encodes the well-known probabilistic temporal logic PCTL. And we give a model-checking algorithm for computing the rational denotational value of a formula at an...
متن کامل{\L}ukasiewicz {\mu}-calculus
The paper explores properties of the Lukasiewicz μ-calculus, or Lμ for short, an extension of Lukasiewicz logic with scalar multiplication and least and greatest fixed-point operators (for monotone formulas). We observe that Lμ terms, with n variables, define monotone piecewise linear functions from [0, 1]n to [0, 1]. Two effective procedures for calculating the output of Lμ terms on rational i...
متن کاملProof Theory for First Order Lukasiewicz Logic
An approximate Herbrand theorem is proved and used to establish Skolemization for first-order Łukasiewicz logic. Proof systems are then defined in the framework of hypersequents. In particular, extending a hypersequent calculus for propositional Łukasiewicz logic with usual Gentzen quantifier rules gives a calculus that is complete with respect to interpretations in safe MV-algebras, but lacks ...
متن کاملLabelled Calculi for Lukasiewicz Logics
In this paper, we define new decision procedures for Łukasiewicz logics. They are based on particular integer-labelled hypersequents and of logical proof rules for such hypersequents. These rules being proved strongly invertible our procedures naturally allow one to generate countermodels. From these results we define a “merge”-free calculus for the infinite version of Łukasiewicz logic and pro...
متن کاملProof theory of witnessed Gödel logic: A negative result
We introduce a first sequent-style calculus for witnessed Gödel logic. Our calculus makes use of the cut rule. We show that this is inescapable by establishing a general result on the non-existence of suitable analytic calculi for a large class of first-order logics. These include witnessed Gödel logic, (fragments of) Łukasiewicz logic, and intuitionistic logic extended with the quantifiers of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Fundam. Inform.
دوره 150 شماره
صفحات -
تاریخ انتشار 2017